电信运营商云网规划数字化研究和实现

基于电信运营商数字化转型，系统性地提出了数据驱动的云网发展规划体系，以及六大关键数字化能力构建，设计和实现了一种云网规划数字化平台，该平台可用于实现目标网络精细规划、边缘计算精准预测等场景，并探讨了数字孪生在规划领域的应用前景，对运营商推进云网融合战略、推进高质量发展具有指导和参考意义。     

Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

Prediction of mode I fracture toughness of rock using linear multiple regression and gene expression programming

Prediction of mode I fracture toughness (K_IC) of rock is of significant importance in rock engineering analyses. In this study, linear multiple regression (LMR) and gene expression programming (GEP) methods were used to provide a reliable relationship to determine mode I fracture toughness of rock. The presented model was developed based on 60 datasets taken from the previous literature. To predict fracture parameters, three mechanical parameters of rock mass including uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), and elastic modulus (E) have been selected as the input parameters. A cluster of data was collected and divided into two random groups of training and testing datasets. Then, different statistical linear and artificial intelligence based nonlinear analyses were conducted on the training data to provide a reliable prediction model of K_IC. These two predictive methods were then evaluated based on the testing data. To evaluate the efficiency of the proposed models for predicting the mode I fracture toughness of rock, various statistical indices including coefficient of determination (R²), root mean square error (RMSE), and mean absolute error (MAE) were utilized herein. In the case of testing datasets, the values of R², RMSE, and MAE for the GEP model were 0.87, 0.188, and 0.156, respectively, while they were 0.74, 0.473, and 0.223, respectively, for the LMR model. The results indicated that the selected GEP model delivered superior performance with a higher R² value and lower errors.     

基于粒子群优化算法的五自由度机械臂轨迹规划

为了让机械臂的工作时间达到最优,以自主研发的抛光机器人样机为研究对象,针对手表表壳表耳部分的抛光过程,提出PSO算法对五自由度机械臂轨迹规划进行优化,并通过MATLAB软件进行机械臂的仿真与分析。仿真结果表明,基于PSO算法的轨迹规划使机械臂在工作过程中加加速度不会产生突变,运动轨迹精度高,机械臂工作时间达到最优。     

基于改进D?Lite遗传算法路径规划研究

针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

一种新的多渐消因子容积卡尔曼滤波

将强跟踪思想引入容积卡尔曼滤波（cubature Kalman filter，CKF），建立强跟踪CKF能有效克服CKF在模型不确定、状态突变等情况下，滤波性能下降的问题。通过分析现有多渐消因子计算方法，发现它们均只利用了协方差矩阵的对角线元素，并没有考虑各个状态之间的相关性，不能充分发挥多渐消因子的优势。为此，本文提出渐消因子矩阵，基于正交原理推导渐消因子矩阵的求解方法，提出多渐消因子强跟踪CKF算法。多渐消因子强跟踪CKF算法突破了传统多渐消因子为向量的限制，也不再要求渐消因子取值要大于1。仿真验证了算法具有更好的滤波精度何鲁棒性，能更好的满足工程应用的要求。     

Strategic planning optimization for natural gas to liquid transportation fuel (GTL) systems

A strategic planning optimization model is proposed for a network of natural gas to liquids (GTL) systems, and it is solved using a rolling horizon strategy. The model formulation determines the strategic and tactical decisions of the GTL supply chain over a long time horizon. The decisions to build new GTL refineries may be made over the span of 30 years and their operations cover the span of 60 years. Multiple capacities of GTL refineries (i.e., 1, 5, 10, 50, and 200 thousand barrels per day) that produce gasoline, diesel, and kerosene commensurate to the United States demand ratio may exist in the network. The parameter inputs include the locations, availabilities, and prices of natural gas in the United States discretized by county, the delivery locations of fuel products, and the transportation costs of every input and output of the refinery, defined for each time period. Formulated as a large-scale mixed-integer linear optimization (MILP) model, the problem is solved using a rolling horizon strategy for tractability. Case studies on the state of Pennsylvania are presented for different planning schemes and their impact on the economic performance of the GTL network is discussed.     

无线传感器网络中移动sink节点的路径规划

在无线传感器网络中,大量感知数据汇集到sink节点的采集方法会导致sink节点附近的节点能量耗尽,造成能量空洞。针对该问题,利用移动的sink节点进行数据收集是一种解决方法,其中移动sink的路径规划成为一个重要的问题。提出了一个移动sink路径规划算法,将无线传感器中随机分布的节点划分为不同的子区域,寻找sink节点移动的最佳转向点,最终得到最优的移动路径,以实现无线传感器网络生命周期最大化。仿真实验表明,与现有方案相比,该算法能显著延长网络的生命周期。     

Generation expansion planning in electricity markets: A novel framework based on dynamic stochastic MPEC

This paper presents a novel framework for generation expansion planning (GEP) of restructured power systems under uncertainty in a multi-period horizon, which includes generation investment from a price maker perspective. The investment problem is modeled as a bi-level optimization problem. The first level problem includes decisions related to investment in order to maximize total profit in the planning horizon. The second level problem consists of maximizing social welfare where the power market is cleared. Rival uncertainties on offering and investment are modeled using sets of scenarios. The bi-level optimization problem is then converted to a dynamic stochastic MPEC and represented as a mixed integer linear program (MILP) after linearization. The proposed framework is examined on a typical six-bus power network, MAZANDARAN regional electric company (MREC) transmission network as an area of IRAN interconnected power system and IEEE RTS 24-bus network. Simulation results confirm that the proposed framework can be a useful tool for analyzing the behavior of investments in electricity markets.